Ising formulations of many NP problems
نویسنده
چکیده
*Correspondence: Andrew Lucas, Lyman Laboratory of Physics, Department of Physics, Harvard University, 17 Oxford St., Cambridge, MA 02138, USA e-mail: [email protected] We provide Ising formulations for many NP-complete and NP-hard problems, including all of Karp’s 21 NP-complete problems. This collects and extends mappings to the Ising model from partitioning, covering, and satisfiability. In each case, the required number of spins is at most cubic in the size of the problem. This work may be useful in designing adiabatic quantum optimization algorithms.
منابع مشابه
Injection-locked Laser Network for Solving Np-complete Problems a Dissertation Submitted to the Department of Electrical Engineering and the Committee on Graduate Studies of Stanford University in Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy
NP(Nondeterministic Polynomial)-complete problems are of great interest in various scientific and engineering fields. Although no algorithm has been found so far to find exact solutions to NP-complete problems efficiently, many have been discovered to search for approximate solutions in polynomial time. Quantum computation can solve problems such as factorization efficiently. However, it still ...
متن کاملA Novel Approach to Ising Problems
In this note we discuss some of the recent remarks on the solvability of Ising problems. These remarks tend to a conclusion that it is likely that some Ising problems, for example that of the simple cubic lattice, are essentially unsolvable. One type of argument relates such problems to the theory of NP-completeness and intractability. Another type of argument is used to shake the belief that a...
متن کاملSimulated Tempering for VLSI Floorplan Designs
In the past two decades, the simulated annealing technique has been considered as a powerful approach to handle many NP-hard optimization problems in VLSI designs. Recently, a new Monte Carlo and optimization technique, named simulated tempering, was invented and has been successfully applied to many scientific problems, from random field Ising modeling to the traveling salesman problem. It is ...
متن کاملA 16-bit Coherent Ising Machine for One-Dimensional Ring and Cubic Graph Problems
Many tasks in our modern life, such as planning an efficient travel, image processing and optimizing integrated circuit design, are modeled as complex combinatorial optimization problems with binary variables. Such problems can be mapped to finding a ground state of the Ising Hamiltonian, thus various physical systems have been studied to emulate and solve this Ising problem. Recently, networks...
متن کاملRelaxed Simulated Tempering for VLSI Floorplan Designs
In the past two decades, the simulated annealing technique has been considered as a powerful approach to handle many NP-hard optimization problems in VLSI designs. Recently, a new Monte Carlo and optimization technique, named simulated tempering, was invented and has been successfully applied to many scientific problems, from random field Ising modeling to the traveling salesman problem. It is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1302.5843 شماره
صفحات -
تاریخ انتشار 2014